Embedding Steiner triple systems into Steiner systems S(2, 4, v)
نویسندگان
چکیده
We initiate a systematic study of embeddings of Steiner triple systems into Steiner systems S(2; 4; v). We settle the existence of an embedding of the unique STS(7) and, with one possible exception, of the unique STS(9) into S(2; 4; v). We also obtain bounds for embedding sizes of Steiner triple systems of larger orders. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Isomorphisms of Infinite Steiner Triple Systems
An infinite countable Steiner triple system is called universal if any countable Steiner triple system can be embedded into it. The main result of this paper is the proof of non-existence of a universal Steiner triple system. The fact is proven by constructing a family S of size 2 of infinite countable Steiner triple systems so that no finite Steiner triple system can be embedded into any of th...
متن کاملThe embedding problem for partial Steiner triple systems
The system has the nice property that any pair of distinct elements of V occurs in exactly one of the subsets. This makes it an example of a Steiner triple system. Steiner triple systems first appeared in the mathematical literature in the mid-nineteenth century but the concept must surely have been thought of long before then. An excellent historical introduction appears in [7]. As pointed out...
متن کاملAn infinite family of Steiner systems S(2, 4, 2m) from cyclic codes
Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...
متن کاملEmbedding Partial Steiner Triple Systems
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missing-edge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple system of order 2n +1, provided that 2w +1 is admissible. We also prove that if there is a partial Stei...
متن کاملSteiner triple ( quadruple ) systems of small ranks embedded into perfect ( extended perfect ) binary codes 1
It is shown that a class of Steiner triple systems of order 2−1, obtained by some special switchings from the Hamming Steiner triple system, is embedded into some perfect code, constructed by known switchings of ijk-components from the binary Hamming code. The number of Steiner triple systems of order n and rank less or equal n− log(n + 1) + 2, embedded into perfect binary codes of length n, is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 274 شماره
صفحات -
تاریخ انتشار 2004